托卡马克中局域磁扰动引起的高能量离子损失研究

基于单粒子导心运动代码ORBIT，采用测试粒子模拟方法，研究了托卡马克等离子体内部不同径向位置处局域磁场扰动对高能量离子的损失的影响。研究表明，在局域磁扰动主要分布在某磁面附近、其环向具有类似纹波场形式下，可造成一些靠近等离子体中心区域的高能量离子损失，但对靠近等离子边界的离子损失影响相对不大。这些损失的高能量离子均为捕获离子，离子的投掷角越大就越容易损失。此外，造成高能量离子最大损失率的局域场径向位置与这些损失离子的初始径向位置通常存在一定的偏移，而且这个偏移与这些离子的能量密切相关。当局域场出现在某些位置时，能量较低的离子会有一定的损失，能量较高的离子反而不会损失。     

多元统计分析中一类矩阵迹函数最小化问题的有效算法

研究来源于多元统计分析中的一类矩阵迹函数最小化问题$\min c+ tr(AX)+\sum\limits_{j=1}^{m}tr(B_j X C_jX^{T}),\ \ {\rm s. t.} \ X^TX=I_p,$其中$c$为常数, $A\in R^{p\times n}\ (n\geq p)$, $B_j\in R^{n\times n}, C_j\in R^{p\times p}$为给定系数矩阵. 数值实验表明已有的Majorization算法虽可行, 但收敛速度缓慢且精度不高. 本文从黎曼流形的角度重新研究该问题, 基于Stiefel流形的几何性质, 构造一类黎曼非单调共轭梯度迭代求解算法, 并给出算法收敛性分析.数值实验和数值比较验证所提出的算法对于问题模型是高效可行的.     

Setting local rank constraints by orthogonal projections for image resolution analysis: Application to the determination of a low dose pharmaceutical compound

Raman chemical imaging provides chemical and spatial information about pharmaceutical drug product. By using resolution methods on acquired spectra, the objective is to calculate pure spectra and distribution maps of image compounds. With multivariate curve resolution-alternating least squares, constraints are used to improve the performance of the resolution and to decrease the ambiguity linked to the final solution. Non negativity and spatial local rank constraints have been identified as the most powerful constraints to be used.     

Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes

An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as the one of a test cover. In this paper, we study the decision problems Identifying Code and Locating-Dominating Set (which consist in deciding whether a given graph admits an identifying code or a locating-dominating set, respectively, with a given size) and their minimization variants Minimum Identifying Code and Minimum Locating-Dominating Set. These problems are known to be NP-hard, even when the input graph belongs to a number of specific graph classes such as planar bipartite graphs. Moreover, it is known that they are approximable within a logarithmic factor, but hard to approximate within any sub-logarithmic factor. We extend the latter result to the case where the input graph is bipartite, split or co-bipartite: both problems remain hard in these cases. Among other results, we also show that for bipartite graphs of bounded maximum degree (at least 3), the two problems are hard to approximate within some constant factor, a question which was open. We summarize all known results in the area, and we compare them to the ones for the related problem Dominating Set. In particular, our work exhibits important graph classes for which Dominating Set is efficiently solvable, but Identifying Code and Locating-Dominating Set are hard (whereas in all previous works, their complexity was the same). We also introduce graph classes for which the converse holds, and for which the complexities of Identifying Code and Locating-Dominating Set differ.     

光寻址电位传感器的正交相位检波检测方法

光寻址电位传感器的幅度检测方法易受噪声干扰,灵敏度差,信噪比和精度低,且受调制光源的影响较大,影响检测结果的准确性.为此提出了一种基于正交相位检波的光寻址电位传感器检测方法.该方法是将光寻址电位传感器的输出光电流信号分别与两路正交信号相乘,通过低通滤波提取直流分量并相除,即可得到光寻址电位传感器的输出信号相位信息.与已有的光寻址电位传感器相位检测方法相比,该方法具有算法复杂度低、实时性高的优点.实验研究了调制光源光强对光寻址电位传感器幅度检测和相位检测的影响,对比分析了光寻址电位传感器的传统幅度检测方法与正交相位检波检测方法对pH检测的灵敏度、线性度及信噪比.结果表明,相比于幅度检测方法,调制光源光强对光寻址电位传感器的相位检测影响更小,在频率为10 kHz,pH的范围为1.68~10.01的情况下,相位检测方法比幅度检测方法测得的灵敏度增加了7 mV/pH,精度提高了14.9 mpH,非线性误差减小了0.003%,均方差减少了0.1051×10^-5,信噪比增加了8.2827 dB.该方法特别适用于弱光下的光寻址电位传感器检测.